Optimal Broadcasting in 2-Dimensional Manhattan Street Networks
نویسندگان
چکیده
ABSTRACT Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. In this paper we consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. Previous work on these networks has been mainly devoted to the study of the average distance and point-to-point routing schemes. Here we provide an algorithm which broadcasts optimally in a 2-dimensional M×N Manhattan Street Network (M and N even).
منابع مشابه
Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks
Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. In this paper we consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. With the use of genetic programming we...
متن کاملThe Spectra of Manhattan Street Networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing, Hamiltonicity, and modular structure. From the known structural properties of these digraphs, we determine their spectra, which always contain the spectra of hypercubes. In particular, in the standard (two-dime...
متن کاملOptimal node placement in an optical packet switching Manhattan street network
The judicious allocation of traffic matrix sources/destinations to nodes of an exemplar optical packet switching architecture, the Manhattan street network, is studied in this paper. The node placement optimisation (NPO) problem is intractable, hence simulated annealing is used to find (near) optimal solutions expeditiously. A number of nonuniform traffic patterns are considered, facilitating t...
متن کاملA new operation on digraphs : the Manhattan product
We give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that if all the factors of the above product are (directed) cycles, then the digraph obtained is a Manhattan street network. To this respect, it is proved that many properties of these networks, such as high symmetries and the presence of Hamiltonian c...
متن کاملThe Manhattan product of digraphs
We study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can be used to built other networks with similar good properties. It is shown that if all the factors of such a product are (directed) cycles, then the digraph obtained is a Manhattan street network, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005